Pascal and Francis Bibliographic Databases

Help

Search results

Your search

kw.\*:("Atteignabilité")

Filter

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Document Type [dt]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Publication Year[py]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Discipline (document) [di]

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Language

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Author Country

A-Z Z-A Frequency ↓ Frequency ↑
Export in CSV

Results 1 to 25 of 2075

  • Page / 83
Export

Selection :

  • and

On accessibility and normal accessibility: the openness of controllability in the fine C° topologyGRASSE, K. A.Journal of differential equations (Print). 1984, Vol 53, Num 3, pp 387-414, issn 0022-0396Article

Infinity of intermediate states is decidable for Petri netsWIMMEL, Harro.Lecture notes in computer science. 2004, pp 426-434, issn 0302-9743, isbn 3-540-22236-7, 9 p.Conference Paper

A note on discrete-time positive realizationsFARINA, L.Systems & control letters. 1994, Vol 22, Num 6, pp 467-469, issn 0167-6911Article

Local accessibility, local reachability, and representations of compact groupsCROUCH, P. E; BYRNES, C. I.Mathematical systems theory. 1986, Vol 19, Num 1, pp 43-65, issn 0025-5661Article

Asymptotic orders of reachability in perturbed linear systemsOZVEREN, C. M; VERGHESE, G. C; WILLSKY, A. S et al.IEEE transactions on automatic control. 1988, Vol 33, Num 10, pp 915-923, issn 0018-9286Article

A reachability algorithm for general petri nets based on transition invariantsKOSTIN, Alexander E.Lecture notes in computer science. 2006, pp 608-621, issn 0302-9743, isbn 3-540-37791-3, 1Vol, 14 p.Conference Paper

ON CANONICAL FORMS FOR LINEAR CONSTANT SYSTEMS = SUR LES FORMES CANONIQUES POUR LES SYSTEMES CONSTANTS LINEAIRESANTOULAS AC.1981; INT. J. CONTROL; ISSN 0020-7179; GBR; DA. 1981; VOL. 33; NO 1; PP. 95-122; BIBL. 13 REF.Article

Reachability and optimal phasing for reconfiguration in near-circular orbit formationsPALMER, Phil.Journal of guidance, control, and dynamics. 2007, Vol 30, Num 5, pp 1542-1546, issn 0731-5090, 5 p.Article

Reachability analysis in boxed ambientsBUSI, Nadia; ZAVATTARO, Gianluigi.Lecture notes in computer science. 2005, pp 143-159, issn 0302-9743, isbn 3-540-29106-7, 1Vol, 17 p.Conference Paper

U-reachability and U-controllability of 2-D Roesser modelKACZOREK, T.Bulletin of the Polish Academy of Sciences. Technical sciences. 1995, Vol 43, Num 1, pp 31-37, issn 0239-7528Article

Reachability in variable structure control systemsWHITE, B. A; SILSON, P. M.IEE proceedings. Part D. Control theory and applications. 1984, Vol 131, Num 3, pp 85-91, issn 0143-7054Article

Polynomial control systemsJURDJEVIC, V; KUPKA, I.Mathematische Annalen. 1985, Vol 272, Num 3, pp 361-368, issn 0025-5831Article

Global reachability results for systems with constrained controllersSCHMITENDORF, W. E; HWANG, W. G.Journal of optimization theory and applications. 1985, Vol 46, Num 4, pp 581-590, issn 0022-3239Article

Asymptote d'ellipsoïdes approchant les domaines d'accessibilitéKLEPFISH, B. R; OVSEEVICH, A. I.Izvestiâ Akademii nauk SSSR. Tehničeskaâ kibernetika. 1984, Num 2, pp 66-69, issn 0002-3388Article

Straight line reachability of Roesser modelKACZOREK, T.IEEE transactions on automatic control. 1987, Vol 32, Num 7, pp 637-639, issn 0018-9286Article

When does the local controllability of the general model of 2-D linear systems imply its local reachability?KACZOREK, T.Systems & control letters. 1994, Vol 23, Num 6, pp 445-452, issn 0167-6911Article

Reduced power automataSUTNER, Klaus.Lecture notes in computer science. 2003, pp 194-202, issn 0302-9743, isbn 3-540-40391-4, 9 p.Conference Paper

Semidynamical systems with non unique global backward extensionsELAYDI, S.Funkcialaj Ekvacioj. 1983, Vol 26, Num 2, pp 173-187, issn 0532-8721Article

Feasible trace reconstruction for rewriting approximationsBOICHUT, Yohan; GENET, Thomas.Lecture notes in computer science. 2006, pp 123-135, issn 0302-9743, isbn 3-540-36834-5, 1Vol, 13 p.Conference Paper

Binary reachability analysis of pushdown timed automata with dense clocksZHE DANG.Lecture notes in computer science. 2001, pp 506-517, issn 0302-9743, isbn 3-540-42345-1Conference Paper

Programs with quasi-stable channels are effectively recognizableCECE, G; FINKEL, A.Lecture notes in computer science. 1997, pp 304-315, issn 0302-9743, isbn 3-540-63166-6Conference Paper

An approach to cyclic protocol validationLIU, H; MILLER, R. E.Computer communications. 1996, Vol 19, Num 14, pp 1175-1187, issn 0140-3664Article

Analyse et commande des systèmes linéaires à coefficients périodiques = Analysis and control of linear periodic systemsRabenasolo, Andriamaherison Besoa; Richard, Jean-Pierre.1992, 207 p.Thesis

On the intersection of controllable and reachable setsGAYEK, J. E; VINCENT, T. L.Journal of optimization theory and applications. 1986, Vol 50, Num 2, pp 267-278, issn 0022-3239Article

Canonical models and the law of requisite varietyCASTI, J. L.Journal of optimization theory and applications. 1985, Vol 46, Num 4, pp 455-459, issn 0022-3239Article

  • Page / 83